Two Party RSA Key Generation ( Extended
نویسنده
چکیده
We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.
منابع مشابه
Efficient Two Party Multi-prime Rsa Key Generation
We present a new protocol which enables two parties to jointly generate a multi-prime RSA key pair such that neither party gains information about the secret key. The expected running time of our algorithm is linear in the bit length of the modulus which is significantly faster than previously known methods.
متن کاملTwo Party RSA Key Generation
We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.
متن کاملTwo Party RSA Key Generation
We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.
متن کاملShared Generation of Shared RSA Keys 1
The paper considers the problem of distributed key generation for shared-control RSA schemes. In particular: how can two parties generate a shared RSA key in such a way that neither party can cheat? The answer to this question would have signi cant applications to, for example, key escrow systems. Cocks has recently proposed protocols to solve this problem in the case when both parties act hone...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold cryptography in the GBD public-key cryptosystem. Both threshold decryption and threshold key generation are covered, in the “honest-butcurious” setting. This shows that it is possible to perform GBD computations in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar...
متن کامل